// Benke PDF. C6 p22.

#include <stdio.h>

// practice 01.
/* int main()
{
    int i, j, k, n;

    i = j = k = n = 0;

    for (n = 100; n < 999; n++)
    {
        i = n / 100;
        j = n / 10 % 10;
        k = n % 10;
        if (i * i * i + j * j * j + k * k * k == n)
        {
            printf("Find: %d\n", n);
        }
    }
    return 0;
} */

int main()
{
    int i, j, k, n;

    i = j = k = n = 0;

    for (n = 100; n < 999; n++)
    {
        i = n / 100;
        j = n / 10 % 10;
        k = n % 10;

        if (i != j && j != k && k != i)
        {
            if (n % 4 == 0)
            {
                printf("Find: %d\n", n);
                break;
            }
        }
    }
    return 0;
}